package com.zhujy.test;
/*
 * Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). 
 * n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). 
 * Find two lines, which together with x-axis forms a container, such that the container contains the most water.
Note: You may not slant the container and n is at least 2.
 * */
public class maxArea {
	 public int maxArea(int[] height) {
	        int m =  height.length;
	        int n = 0;
	        int maxArea = 0;
	        while(n<m) {
	        	int h = Math.min(height[n], height[m]);
	        	int tempA = h * (m-n);
	        	if(maxArea<tempA)
	        		maxArea = tempA;
	        	if(height[n]<height[m]) {
	        		n++;
	        	}else {
	        		m--;
	        	}
	        }
	        return maxArea;
	 }
}
